منابع مشابه
Kemeny's Constant and the Random Surfer
We revisit Kemeny’s constant in the context of Web navigation, also known as “surfing”. We derive bounds on the constant and give it a novel interpretation in terms of the number of links a random surfer will follow to reach his final destination.
متن کاملA Random-Surfer Web-Graph Model
In this paper we provide theoretical and experimental results on a random-surfer model for construction of a random graph. In this model, a new node connects to the existing graph by choosing a start node uniformly at random and then performing a short random walk. We show that in certain formulations, this results in the same distribution as the preferential-attachment random-graph model, and ...
متن کاملDetecting Webspam Beneficiaries Using Information Collected by the Random Surfer
Search engines use several criteria to rank webpages and choose which pages to display when answering a request. Those criteria can be separated into two notion, relevance and popularity. This notion of popularity is calculated by the search engine and is related to links made to the webpage. Malicious webmasters want to artificially increase their popularity, the techniques they use are often ...
متن کاملThe Generalized Web Surfer
Different models have been proposed for improving the results of Web search by taking into account the link structure of the Web. The PageRank algorithm models the behavior of a random surfer alternating between random jumps to new pages and following out links with equal probability. We propose to improve on PageRank by using an intelligent surfer that combines link structure and content to de...
متن کاملThe Grothendieck constant of random and pseudo-random graphs
The Grothendieck constant of a graph G = (V,E) is the least constant K such that for every matrix A : V × V → R: max f :V→S|V |−1 ∑ {u,v}∈E A(u, v) · 〈f(u), f(v)〉 ≤ K max :V→{−1,+1} ∑ {u,v}∈E A(u, v) · (u) (v). The investigation of this parameter, introduced in [2], is motivated by the algorithmic problem of maximizing the quadratic form ∑ {u,v}∈E A(u, v) (u) (v) over all : V → {−1, 1}, which a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Mathematical Monthly
سال: 2002
ISSN: 0002-9890
DOI: 10.2307/3072398